Sandwiching random graphs
نویسندگان
چکیده
The goal of this paper is to establish a connection between two classical models of random graphs: the random graph G(n, p) and the random regular graph Gd(n). This connection appears to be very useful in deriving properties of one model from the other. In particular, one immediately obtains one-line proofs of several highly non-trivial and recent results on Gd(n).
منابع مشابه
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
We establish an inclusion relation between two uniform models of random k-graphs (for constant k ≥ 2) on n labeled vertices: G(k)(n,m), the random k-graph with m edges, and R(k)(n, d), the random d-regular k-graph. We show that if n log n m nk we can choose d = d(n) ∼ km/n and couple G(k)(n,m) and R(k)(n, d) so that the latter contains the former with probability tending to one as n → ∞. This e...
متن کاملChiroptical inversion induced by sandwiching units in chiral polythiourethane.
Chiroptical behavior of a hydrogen-bond-regulated chiral polythiourethane segment was inversed by sandwiching sterically demanding segments in copolymers prepared by cationic ring-opening copolymerization of chiral cyclic thiourethanes derived from L-serine.
متن کاملOn Vertex, Edge, and Vertex-Edge Random Graphs (Extended Abstract)
We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdős-Rényi random graphs [9, 10], vertex random graphs are generalizations of geometric random graphs [21], and vertex-edge random graphs generalize both. The names of these three types of random graphs describe where the randomness in the models lies: in ...
متن کاملOn Vertex, Edge, and Vertex-edge Random Graphs
We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdős-Rényi random graphs [8, 9], vertex random graphs are generalizations of geometric random graphs [20], and vertexedge random graphs generalize both. The names of these three types of random graphs describe where the randomness in the models lies: in th...
متن کامل. C O ] 8 D ec 2 00 8 ON VERTEX , EDGE , AND VERTEX - EDGE RANDOM GRAPHS
We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erd˝ os-Rényi random graphs [5, 6], vertex random graphs are generalizations of geometric random graphs [16], and vertex-edge random graphs generalize both. The names of these three types of random graphs describe where the randomness in the models lies: in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002